Least Common Ancestor Networks

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Least Common Ancestor Networks

Least Common Ancestor Networks (LCANs) are introduced and shown to be a class of networks that include fat-trees, baseline networks, SW-banyans and the router networks of the TRAC 1.1 and 2.0, and the CM-5. Some LCAN properties are stated and the permutation routing capabilities of an important subclass are analyzed. Simulation results for three permutation classes verify the accuracy of an ite...

متن کامل

2 Least Common Ancestor

In particular, we are allowed to preprocess the texts in order to be able to answer the query faster. Our preprocessing choice was the use of a single suffix tree, in which all the suffixes of all the texts appear, each suffix ending with a distinct symbol that determines the text in which the suffix appears. In order to answer the query we reduced the problem to range-min queries, which in tur...

متن کامل

Winter School 2003, St. Petersburg The Least Common Ancestor Problem

The Least Common Ancestor Problem can be used to solve many other algorithmic problems on trees. It is shown that an efficient and simple solution is possible.

متن کامل

Informative Labeling Schemes for the Least Common Ancestor Problem

We address the problem of labeling the nodes of a tree such that one can determine the identifier of the least common ancestor of any two nodes by looking only at their labels. This problem has application in routing and in distributed computing in peer-to-peer networks. A labeling scheme using Θ(log n)-bit labels has been presented by Peleg. By engineering this scheme and a new one due to the ...

متن کامل

Lowest Common Ancestor(LCA)

Before embarking into the technicalities of the different algorithms for LCA, let us first agree on the terminology that we will be using throughout this article. Let there be a rooted tree T(E,V). A node x ∈ T is called an ancestor of a node y ∈ T if the path from the root of T to y goes through x. Also, a node v ∈ T is called to be a common ancestor of x and y if it is an ancestor of both x a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: VLSI Design

سال: 1995

ISSN: 1065-514X,1563-5171

DOI: 10.1155/1995/53054